Dynamics of Random Graphs with Bounded Degrees
نویسندگان
چکیده
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this linking step until a regular random graph, where all nodes have degree d, forms. We view this process as a multivariate aggregation process, and formally solve the evolution equations using the Hamilton-Jacobi formalism. We calculate the nontrivial percolation thresholds for the emergence of the giant component when d ≥ 3. Also, we estimate the number of steps until the giant component spans the entire system and the total number of steps until the regular random graph forms. These quantities are non self-averaging, namely, they fluctuate from realization to realization even in the thermodynamic limit.
منابع مشابه
Concentration and regularization of random graphs
This paper studies how close random graphs are typically to their expectations. We interpret this question through the concentration of the adjacency and Laplacian matrices in the spectral norm. We study inhomogeneous Erdös-Rényi random graphs on n vertices, where edges form independently and possibly with different probabilities pij . Sparse random graphs whose expected degrees are o(logn) fai...
متن کاملCritical behavior in inhomogeneous random graphs
We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal edge occupation probabilities. We show that the critical behavior depends sensitively on the properties of the asymptotic degrees. Indeed, when the proportion of vertices with degree at least k is bounded above by k−τ+1 for some τ > 4, the largest critical connected component is ...
متن کاملRandom graphs with arbitrary i.i.d. degrees
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree distribution is regularly varying with exponent 1 − τ . There are three distinct cases: (i) τ > 3, where the degrees have finite variance, (ii) τ ∈ (2, 3), where the d...
متن کاملSpectral Partitioning of Random Graphs with Given Expected Degrees
It is a well established fact, that – in the case of classical random graphs like (variants of) Gn,p or random regular graphs – spectral methods yield efficient algorithms for clustering (e. g. colouring or bisection) problems. The theory of large networks emerging recently provides convincing evidence that such networks, albeit looking random in some sense, cannot sensibly be described by clas...
متن کاملThe front of the epidemic spread and first passage percolation
In this paper we establish a connection between epidemic models on random networks with general infection times considered in [2] and first passage percolation. Using techniques developed in [6], when each vertex has infinite contagious periods, we extend results on the epidemic curve in [2] from bounded degree graphs to general sparse random graphs with degrees having finite third moments as n...
متن کامل